منابع مشابه
Triangular G Splines
We introduce curvature continuous regular free form surfaces with triangular control nets These surfaces are composed of quartic box spline surfaces and are piecewise polynomial multisided patches of total degree which minimize some energy integral The B ezier nets can be computed e ciently form the spline control net by some xed masks i e matrix multiplications x Introduction Most methods know...
متن کاملRefinable polycube G-splines
Polycube G-splines form a 2-manifold guided by a mesh of quadrilateral faces such that at most six quads meet at each vertex. In particular, this replicates the layout of the quad faces of a polycube. Polycube G-splines are piecewise bicubic and polycube Gspline surfaces are almost everywhere tangent-continuous (G) based on rational linear reparameterization. They can be constructed in two diff...
متن کاملRational G Splines
We develop a class of rational, G2-connected splines of degree 3 that allow modeling multiple basic shapes, such as segments of conics and circle arcs in particular, in one structure. This can be used, for example, to have portions of a control polygon exactly reproduce segments of the shapes while other portions blend between these primary shapes. We also show how to reparameterize the splines...
متن کاملData Analysis Using G/Splines
G/SPLINES is an algorithm for building functional models of data. It uses genetic search to discover combinations of basis functions which are then used to build a least-squares regression model. Because it produces a population of models which evolve over time rather than a single model, it allows analysis not possible with other regression-based approaches.
متن کاملG/SPLINES: A Hybrid of Friedman's Multivariate Adaptive Regression Splines (MARS) Algorithm with Holland's Genetic Algorithm
G/SPLINES ate a hybrid of Friedman's Multivariable Adaptive Regression Splines (MARS) algorithm with Holland's Genetic Algorithm. In this hybrid, the incremental search is replaced by a genetic search. The G/SPLINE algorithm exhibits performance comparable to that of the MARS algorithm, requires fewer least-squares computations, and allows significantly larger problems to be considered.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Approximation Theory
سال: 1977
ISSN: 0021-9045
DOI: 10.1016/0021-9045(77)90097-1